An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order
نویسندگان
چکیده
منابع مشابه
A New Method for Generating Permutations in Lexicographic Order
First, an ordinal representation scheme for permutations is defined. Next, an “unranking” algorithm that can generate a permutation of n items according to its ordinal representation is designed. By using this algorithm, all permutations can be systematically generated in lexicographic order. Finally, a “ranking” algorithm that can convert a permutation to its ordinal representation is designed...
متن کاملK-sorted Permutations with Weakly Restricted Displacements
A permutation ) ( 2 1 n π π π π = of {1, 2,..., n} is called k-sorted if and only if , k i i ≤ −π for all . 1 n i ≤ ≤ We propose an algorithm for generating the set of all k-sorted permutations of {1, 2,..., n} in lexicographic order. An inversion occurs between a pair of ( i π , j π ) if i < j but i π > j π . Let I(n, k) denote the maximum number of inversions in k-sorted permutations. For k...
متن کاملA Simple Systolic Algorithm for Generating Combinations in Lexicographic Order
A systolic algorithm is described for generating, in lexicographlcally ascending order, all combinations of m objects chosen from {1 .... ,n). The algorithm is designed to he executed on a linear array of m processors, each having constant size memory, and each being responsible for producing one dement of a given combination. There is a constant delay per combination, leading to an O(C(m, n)) ...
متن کاملParallel Algorithm for Generating Permutations on Linear Array
Given n items, a parallel algorithm for generating the n! permutations is presented. This algorithm is designed to run on a linear array consisting of n identical processing elements (PEs for short). These PEs are numbered and referred to as PE(i) for 1 < i < n. Each PE is responsible for producing one component of each permutation. Every PE(i) contains six registers, namely: C(i), T(i), K(i), ...
متن کاملMultiset Permutations in Lexicographic Order
In a previous work [12], we proposed a method for generating permutations in lexicographic order. In this study, we extend it to generate multiset permutations. A multiset is a collection of items that are not necessarily distinct. The guideline of the extension is to skip, as soon as possible, those partially-formed permutations that are less than or equal to the latest generated eligible perm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 20 شماره
صفحات -
تاریخ انتشار 1994